Localized eigenvectors on metric graphs

نویسندگان

چکیده

We analyze the eigenvectors of generalized Laplacian for two metric graphs occurring in practical applications. In accordance with random network theory, localization an eigenvector is rare and should be tuned to observe exactly localized eigenvectors. derive resonance conditions obtain various geometric configurations their combinations form more complicated resonant structures. These suggest new indicators based on energy density; contrast standard criteria, ours provide number active edges. also ways design resonating systems graphs. Finally, numerical simulations time-dependent wave equation graph show that can excited by a broadband initial condition, even leaky boundary conditions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solis Graphs and Uniquely Metric Basis Graphs

A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...

متن کامل

Metric problems on graphs

Some properties of homometric sets are known in Music Theory for at least fifty years [16]. We define homometric sets in graphs as follows. Let G = (V,E) denote a simple graph with the vertex set V and the edge set E. Given a vertex set V ′ ⊆ V , the profile of V ′ denotes the multiset of pairwise distances in G between the vertices of V ′. Two disjoint vertex sets of the same size A ⊆ V and B ...

متن کامل

Principal eigenvectors of irregular graphs

Let G be a connected graph. This paper studies the extreme entries of the principal eigenvector x of G, the unique positive unit eigenvector corresponding to the greatest eigenvalue λ1 of the adjacency matrix of G. If G has maximum degree ∆, the greatest entry xmax of x is at most 1/ q 1 + λ1/∆. This improves a result of Papendieck and Recht. The least entry xmin of x as well as the principal r...

متن کامل

Extended graphs based on KM-fuzzy metric spaces

This paper,  applies the concept  of KM-fuzzy metric spaces and  introduces a novel concept of KM-fuzzy metric  graphs based on KM-fuzzy metric spaces.  This study, investigates the finite KM-fuzzy metric spaces with respect to metrics and KM-fuzzy metrics and constructs KM-fuzzy metric spaces on any given non-empty sets. It tries to  extend   the concept of KM-fuzzy metric spaces to  a larger ...

متن کامل

Stochastic flows on metric graphs

We study a simple stochastic differential equation (SDE) driven by one Brownian motion on a general oriented metric graph whose solutions are stochastic flows of kernels. Under some conditions, we describe the laws of all solutions. This work is a natural continuation of [17, 8, 10] where some particular metric graphs were considered.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics and Computers in Simulation

سال: 2023

ISSN: ['0378-4754', '1872-7166']

DOI: https://doi.org/10.1016/j.matcom.2023.07.011